function [ xij, n, w  ] = calcXij()
% n = max number of counted turns
% w = max number of counted straights
% The first values are copied from the table in the paper "The discrete
% Evasion Game with three move Lag"; the rest can be calculated by the
% recursive Formula
n=10;
w=40;
xij=zeros(n,w);
xij(1,1)=0.692931747;
xij(1,2)=0.610829039;
xij(2,1)=0.658667776;
xij(2,2)=0.666948197;
xij(3,1)=0.674229821;
xij(3,2)=0.631168924;
xij(4,1)=0.630222820;
xij(4,2)=0.657034216;
xij(5,1)=0.621135600;
xij(5,2)=0.650149142;
xij(6,1)=0.612994515;
xij(6,2)=0.652420020;
xij(7,1)=0.610779150;
xij(7,2)=0.653041329;
xij(8,1)=0.610191907;
xij(8,2)=0.653216578;
xij(9,1)=0.610041868;
xij(9,2)=0.653244956;
xij(10,1)=0.610002549;
xij(10,2)=0.653275098;

xij(1,3)=0.681299091;
xij(2,3)=0.656431517;
xij(3,3)=0.677632736;
xij(4,3)=0.671270498;
xij(5,3)=0.672914619;
xij(6,3)=0.672368510;
xij(7,3)=0.672219757;
xij(8,3)=0.672177850;
xij(9,3)=0.672171066;
xij(10,3)=0.672163861;


xij(1,4)=0.641975611;
xij(2,4)=0.655910191;
xij(3,4)=0.646267435;
xij(4,4)=0.653826316;
xij(5,4)=0.651859265;
xij(6,4)=0.652511571;
xij(7,4)=0.652689435;
xij(8,4)=0.652739557;
xij(9,4)=0.652747671;
xij(10,4)=0.652756289;

for i=1:n
   for j=3:(w-2)
    xij(i,j+2)=(xij(i,j)*(1-xij(1,1)+xij(1,1)*xij(i,j+1))+(1-xij(i,j))*(1-xij(1,1))*xij(2,1)-0.2883685838)/(xij(i,j)*xij(i,j+1));
   end
end
end

